Weakly-relational shapes for numeric abstractions: improved algorithms and proofs of correctness

نویسندگان

  • Roberto Bagnara
  • Patricia M. Hill
  • Enea Zaffanella
چکیده

Weakly-relational numeric constraints provide a compromise between complexity and expressivity that is adequate for several applications in the field of formal analysis and verification of software and hardware systems. We address the problems to be solved for the construction of full-fledged, efficient and provably correct abstract domains based on such constraints. We first propose to work with semantic abstract domains, whose elements are geometric shapes, instead of the (more concrete) syntactic abstract domains of constraint networks and matrices on which the previous proposals are based. This allows to solve, once and for all, the problem whereby closure by entailment, a crucial operation for the realization of such domains, seemed to impede the realization of proper widening operators. In our approach, the implementation of widenings relies on the availability of an effective reduction procedure for the considered constraint description: one for the domain of bounded difference shapes already exists in the literature; we provide algorithms for the significantly more complex cases of rational and integer octagonal shapes. We also improve upon the state-of-the-art by presenting, along with their proof of correctness, closure by entailment algorithms of reduced complexity for domains based on rational and integer octagonal constraints. The consequences of implementing weakly-relational numerical domains with floating point numbers are also discussed. This work has been partly supported by MURST projects “Constraint Based Verification of Reactive Systems” and “AIDA — Abstract Interpretation: Design and Applications,” and by a Royal Society (UK) International Joint Project (ESEP) award. R. Bagnara Department of Mathematics, University of Parma Viale G. P. Usberti 53/A, 43100 Parma, Italy Tel.: +39-0521-906917, Fax: +39-0521-906950, E-mail: [email protected] P. M. Hill School of Computing, University of Leeds Leeds LS2 9JT, ENGLAND Tel.: +44-(0)113-3436807, Fax: +44-(0)113-3435468, E-mail: [email protected] E. Zaffanella Department of Mathematics, University of Parma, Italy Viale G. P. Usberti 53/A, 43100 Parma, Italy Tel.: +39-0521-906963, Fax: +39-0521-906950, E-mail: [email protected]

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Incrementally Closing Octagons

Abstract The octagon abstract domain is a widely used numeric abstract domain expressing relational information between variables whilst being both computationally efficient and simple to implement. Each element of the domain is a system of constraints where each constraint takes the restricted form ̆xi ̆xj ď c. A key family of operations for the octagon domain are closure algorithms, which check...

متن کامل

Some results on weakly contractive maps

In this paper direct proofs of some common fixed point results for two and three mappings under weak contractive conditions are given. Some of these results are improved by using different arguments of control functions. Examples are presented showing that some generalizations cannot be obtained and also that our results are distinct from the existing ones.

متن کامل

Modal Kleene Algebra and Partial Correctness

We enrich Kleene algebra by domain and codomain operators. These abstractions of relational notions give rise to four modal operators. The boxes and diamonds enjoy various symmetries via Galois connections and dualities. Lifting modal statements to modal operator semirings yields a further abstraction and thus a more elegant and concise “statefree” reasoning about modalities. We use this modal ...

متن کامل

Lifting Temporal Proofs through Abstractions

Model checking is often performed by checking a transformed property on a suitable finite-state abstraction of the source program. Examples include abstractions resulting from symmetry reduction, data independence, and predicate abstraction. The two programs are linked by a structural relationship, such as simulation or bisimulation, guaranteeing that if the transformed property holds on the ab...

متن کامل

Relational Analysis and Precision via Probabilistic Abstract Interpretation

Within the context of a quantitative generalisation of the well established framework of Abstract Interpretation – i.e. Probabilistic Abstract Interpretation – we investigate a quantitative notion of precision which allows us to compare analyses on the basis of their expected exactness for a given program. We illustrate this approach by considering various types of numerical abstractions of the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Formal Methods in System Design

دوره 35  شماره 

صفحات  -

تاریخ انتشار 2009